The Mx/G/1 queue with single and multiple vacations under the LIFO service regime

نویسندگان

  • Eitan Rosenberg
  • Uri Yechiali
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of a Batch Arrival General Bulk Service Queueing System with Multiple Vacations, Setup Time and Server’s Choice of Admitting Re-service

In many practical situations one can observe that the leaving batch of customers may request for re-service. Avi Itzhak and Naor (1963) have analyzed an M/G/1 queueing model with repair of service station on request by a leaving customer. Rosenberg and Uri Yechiali (1993) analyzed a bulk arrival general service single server queue with single and multiple vacations under LIFO service regime. Hu...

متن کامل

Analysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures

This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...

متن کامل

Finite Capacity Queuing System with Vacations and Server Breakdowns

This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...

متن کامل

ON (A,C,B) POLICY QUEUE WITH CHANGE OVER TIMES UNDER BERNOULLI SCHEDULE VACATION INTERRUPTION

This paper analyzes a renewal input  working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

متن کامل

Bat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Oper. Res. Lett.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1993